A Note on Parametric Network Flows

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on generalized flows

The problem of constructing flows associated with first order ordinary differential equations (ODEs) with spatially non-Lipschitz right-hand side is considered. Due to the lack of uniqueness of the solutions, standard flows cannot be defined in this case. For these situations, it is natural to introduce generalized flows which are random fields constructed by assigning a probability measure on ...

متن کامل

A note on Solving Parametric Polynomial Systems

Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our improvements the output of our algorithm is always minimal and it does not need to compute the radical of ideals.

متن کامل

A note on antisymmetric flows in graphs

We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z2 ×Z3-antisymmetric flow, which improves the bounds obtained by DeVos, Johnson and Seymour, and DeVos, Nešetřil and Raspaud.

متن کامل

developing turbulent flows in rectangular channels: a parametric study

the developing turbulent flow in an open channel is a complex three-dimensional flow influenced by the secondary currents and free surface effects and is, therefore, not amenable to analytical solution. this paper aims to study the impact of three key hydraulic parameters (relative roughness, the froude number and the reynolds number) on the establishment length using computational fluid dynami...

متن کامل

A note on network reliability

Let G = (V,E) be a loopless undirected multigraph, with a probability pe, 0 ≤ pe ≤ 1 assigned to every edge e ∈ E. Let Gp be the random subgraph of G obtained by deleting each edge e of G, randomly and independently, with probability qe = 1 − pe. For any nontrivial subset S ⊂ V let (S, S) denote, as usual, the cut determined by S, i.e., the set of all edges of G with an end in S and an end in i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Management Science

سال: 1973

ISSN: 0025-1909,1526-5501

DOI: 10.1287/mnsc.19.5.585